On the weight of universal insertion grammars
نویسندگان
چکیده
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achieved by either applying an inverse morphism and a weak coding, or a left (right) quotient with a regular language. A consequences for the closure properties of insertion grammars are shown. We also study an application in DNA computing and improve some known results concerning the power of insertion-deletion DNA systems.
منابع مشابه
Pericardial Effusion in an Extreme Low Birth Weight Neonate with Peripherally Inserted Central Catheter
Background: Pericardial effusion and cardiac tamponade are the rare complications of peripherally inserted central catheters (PICC insertion) in extreme low birth weight infants. In this regard, paying attention to these complications is of utmost importance, because they can result in infant death. Case report: The case of our infant is a sa...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملMulti-Component Tree Insertion Grammars
In this paper we introduce a new mildly context sensitive formalism called Multi-Component Tree Insertion Grammar. This formalism is a generalization of Tree Insertion Grammars in the same sense that Multi-Component Tree Adjoining Grammars is a generalization of Tree Adjoining Grammars. We show that this class of grammatical formalisms is equivalent to Multi-Component Tree Adjoining Grammars, a...
متن کاملA Maximum Entropy Model of Phonotactics and
The study of phonotactics (e.g., the ability of English speakers to distinguish possible words like blick from impossible words like *bnick) is a central topic in phonology. We propose a theory of phonotactic grammars and a learning algorithm that constructs such grammars from positive evidence. Our grammars consist of constraints that are assigned numerical weights according to the principle o...
متن کاملOne-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules
We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for P systems with (one-dimensional) insertion rules is undecidable. Then we show computational completeness of P systems using (one-dimensional) array insertion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 396 شماره
صفحات -
تاریخ انتشار 2008